The classification and the computation of the zeros of quaternionic, two-sided polynomials
نویسندگان
چکیده
Already for a long time it is known that quaternionic polynomials whose coefficients are located only at one side of the powers, may have two classes of zeros: isolated zeros and spherical zeros. Only recently a classification of the two types of zeros and a means to compute all zeros of such polynomials have been developed. In this investigation we consider quaternionic polynomials whose coefficients are located at both sides of the powers, and we show that there are three more classes of zeros defined by the rank of a certain real (4 × 4) matrix. This information can be used to find all zeros in the same class if only one zero in that class is known. The essential tool is the description of the polynomial p by a matrix equation P (z) := A(z)z + B(z), where A(z) is a real (4× 4) matrix determined by the coefficients of the given polynomial p and P, z, B are real column vectors with four rows. This representation allows also to include two-sided polynomials which contain several terms of the same degree. We applied Newton’s method to P (z) = 0. This method turned out to be a very effective tool in finding the zeros. This method allowed also to prove, that the essential number of zeros of a quaternionic, two-sided polynomial p of degree n is, in general, not bounded by n. We conjecture that the bound is 2n. There are various examples.
منابع مشابه
Domain of attraction of normal law and zeros of random polynomials
Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملEla Zeros of Unilateral Quaternionic Polynomials
The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigenvectors of the corresponding companion matrix. This approach, probably superfluous in the case of quadratic equations for which a closed formula can be given, becomes truly useful for (unilateral) n-order polynomials. To understand the st...
متن کاملUsing Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions
Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 115 شماره
صفحات -
تاریخ انتشار 2010